Enhanced Cache Gird Partitioning Technique for K-NN Queries
نویسنده
چکیده
Mobile database applications through wireless equipments e.g., PDAs, laptops, cell phones and etc. are growing rapidly. In such environment, clients, servers and object may change their locations. A very applicable class of query is continuous k-NN query which continuously returns the k nearest objects to the current location of the requester. Respect to limitations in mobile environments, it is strongly recommended to minimize number of connections and volume of data transmission from the servers. Caching seems to be very profitable in such situations. In this paper, a enhanced cache grid partitioning technique for continuous k-NN queries in mobile DBSs is proposed. In this, by square grid partitioning the complete search space is divided into such grid areas so that we can impose a piecemeal ordering on the query targets. Simulation results show that the proposed cache grid partitioning schema provides a considerable improvement in response time, number of connections and volume of transferred data from DB server.
منابع مشابه
Data Retrieval Mechanisms in Mobile Environments by Using Spatial Queries
------------------------------------------------------------------------ABSTRACT--------------------------------------------------------This work discusses a novel hybrid replacement policy to adopt in the design of our cache. According to our hybrid caching strategy, the results of the most frequently accessed queries are maintained in a static cache of fixed size, which is completely rebuilt ...
متن کاملMCC-DB: Minimizing Cache Conflicts in Multi-core Processors for Databases
In a typical commercial multi-core processor, the last level cache (LLC) is shared by two or more cores. Existing studies have shown that the shared LLC is beneficial to concurrent query processes with commonly shared data sets. However, the shared LLC can also be a performance bottleneck to concurrent queries, each of which has private data structures, such as a hash table for the widely used ...
متن کاملAccelerating High-Dimensional Nearest Neighbor Queries
The performance of nearest neighbor (NN) queries degrades noticeably with increasing dimensionality of the data. This stems not only from reduced selec-tivity of high-dimensional data but also from an increased number of seek operations during NN-query execution. If the NN-radii would be known in advance, the disk accesses could be reordered such that seek operations are minimized. We therefore...
متن کاملReducing non-determinism of k-NN searching in non-ordered discrete data spaces
a r t i c l e i n f o a b s t r a c t We propose a generalized version of the Granularity-Enhanced Hamming (GEH) distance for use in k-NN queries in non-ordered discrete data spaces (NDDS). The use of the GEH distance metric improves search semantics by reducing the degree of non-determinism of k-NN queries in NDDSs. The generalized form presented here enables the GEH distance to be used for a ...
متن کاملk-NN Multimedia Retrieval in Unstructured Peer-to-Peer Networks
AbstractRecent years saw the rapid development of peer-to-peer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topology and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could r...
متن کامل